On weakly uniform integer additive set-indexers of graphs
نویسندگان
چکیده
منابع مشابه
A study on prime arithmetic integer additive set-indexers of graphs
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function f : V (G) → P(N0) such that the induced function f : E(G)→ P(N0) defined by f(uv) = f(u)+f(v) is also injective, where N0 is the set of all non-negative integers. A graph G which admits an IASI is called an IASI graph. An IASI of a graph G is said...
متن کاملWeak Integer Additive Set-Indexers of Certain Graph Products
An integer additive set-indexer is defined as an injective function f : V (G) → 2N0 such that the induced function gf : E(G) → 2N0 defined by gf (uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). If gf (uv) = k ∀ uv ∈ E(G), then f is said to be a k-uniform integer additive set-indexers. An integer additive set-indexer f is said to be a weak integer additive ...
متن کاملTopological Integer Additive Set-Graceful Graphs
Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power set of X by P(X). An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) ! P(X) such that the induced function f+ : E(G) ! P(X) is defined by f+(uv) = f(u) + f(v), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL f is said to be a topological IASL (Top-IAS...
متن کاملOn Uniform Linear Hypergraph Set-indexers of a Graph
For a graph G = (V,E) and a non-empty set X, a linear hypergraph set-indexer (LHSI) is a function f : V (G)→ 2X satisfying the following conditions: (i)f is injective (ii) the ordered pair Hf (G) = (X, f(V )), where f(V ) = {f(v) : v ∈ V (G)}, is a linear hypergraph, (iii) the induced set-valued function f⊕ : E → 2X , defined by f⊕(uv) = f(u)⊕ f(v),∀ uv ∈ E is injective, and (iv) Hf⊕(G) = (X, f...
متن کاملStrong Integer Additive Set-Valued Graphs: A Creative Review
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph G is an injective function f : V (G) ! P(X) such that the induced edge-function f : E(G) ! P(X) ?? f;g is defined by f (uv) = f(u) f(v) for every uv2E(G), where P(X) is the power set of the set X and is a binary operation on sets. A set-indexer of a graph G is an set-labeling f : V (G) such that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2013
ISSN: 1314-7536
DOI: 10.12988/imf.2013.310188